On the enumerating series of an abstract numeration system

نویسندگان

  • Pierre-Yves Angrand
  • Jacques Sakarovitch
چکیده

It is known that any rational abstract numeration system is faithfully, and effectively, represented by an N-rational series. A simple proof of this result is given which yields a representation of this series which in turn allows a simple computation of the value of words in this system and easy constructions for the recognition of recognisable sets of numbers. It is also shown that conversely it is decidable whether an N-rational series corresponds to a rational abstract numeration system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstract Numeration Systems and Tilings

numeration systems and tilings Valérie Berthé and Michel Rigo 1 LIRMM, CNRS-UMR 5506, Univ. Montpellier II, 161 rue Ada, 34392 Montpellier Cedex 5, France, [email protected] 2 Université de Liège, Institut de Mathématiques, Grande Traverse 12 (B 37), B-4000 Liège, Belgium, [email protected] Abstract. An abstract numeration system is a triple S = (L,Σ,<) where (Σ,<) is a totally ordered alphabet an...

متن کامل

Multi-dimensional sets recognizable in all abstract numeration systems

numeration systems An abstract numeration system is a triple S = (L,Σ, <) where L is an infinite regular language over the totally ordered alphabet (Σ, <) By enumerating words of L in the radix order (induced by <), we define a one-to-one correspondence between N and L repS : N → L : n 7→ (n + 1)th word of L valS = rep −1 S : L → N Abstract numeration systems Example S = (a∗b∗, {a, b}, a < b) L...

متن کامل

Representing real numbers in a generalized numeration system

numeration systems An abstract numeration system (ANS) is given by a triplet S = (L,Σ, <) where L is a regular language over a totally ordered alphabet (Σ, <). By enumerating the words in L with respect to the radix order induced by <, we define a one-to-one correspondence: repS : N → L valS = rep −1 S : L → N. ANS: a generalization Most numeration systems satisfy the relation: m < n (usual ord...

متن کامل

Multidimensional generalized automatic sequences and shape-symmetric morphic words

Numeration Systems Definition An abstract numeration system is a triple S = (L,Σ, <) where L is a regular language over a totally ordered alphabet (Σ, <). Enumerating the words of L with respect to the genealogical ordering induced by < gives a one-to-one correspondence repS : N → L valS = rep −1 S : L → N. Example L = a∗, Σ = {a} n 0 1 2 3 4 · · · rep (n) ε a aa aaa aaaa · · · Abstract Numerat...

متن کامل

Abstract numeration systems on bounded languages and multiplication by a constant

numeration systems on bounded languages and multiplication by a constant Emilie Charlier, Michel Rigo, Wolfgang Steiner 1 Institute of Mathematics, University of Liège, Grande Traverse 12 (B 37), B-4000 Liège, Belgium. {echarlier,M.Rigo}@ulg.ac.be 2 LIAFA, CNRS, University Paris Diderot, case 7014, 2 place Jussieu, F-75251 Paris Cedex 05, France, [email protected] Abstract. A set of inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1108.5711  شماره 

صفحات  -

تاریخ انتشار 2010